Optimization of Scheduling and Dispatching Cars on Demand

Taxicab is the most common type of on-demand transportation service in the city because its dispatching system offers better services in terms of shorter wait time. However, the shorter wait time and travel time for multiple passengers and destinations are very considerable. There are recent companies implemented the real-time ridesharing model that expects to reduce the riding cost when passengers are willing to share their rides with the others. This model does not solve the shorter wait time and travel time when there are multiple passengers and destinations. This paper investigates how the ridesharing can be improved by using the genetic algorithm that gives the optimal solution in terms of passengers wait time and routes duration among passengers’ start and end locations. The simulator uses the Google digital maps and direction services that allow the simulator to fetch the real-time data based on the current traffic conditions such as accident, peak hours, and weather. The simulation results that are sub-optimal routes are computed using the advanced genetic algorithm and real-time data availability

Boundary behavior of the Kobayashi metric near a point of infinite type

Under a potential-theoretical hypothesis named $f$-Property with $f$ satisfying $\displaystyle\int_t^\infty \dfrac{da}{a f(a)}<\infty$, we show that the Kobayashi metric $K(z,X)$ on a weakly pseudoconvex domain \Om, satisfies the estimate K(z,X)\ge Cg(\delta_\Om(x)^{-1})|X| for any X\in T^{1,0}\Om where $(g(t))^{-1}$ denotes the above integral and \delta_\Om(z) is the distance from $z$ to b\Om.Comment: 15 page